Logically Instantaneous Communication on Top of Distributed Memory Parallel Machines

Communication is Logically Instantaneous (li) if it is possible to timestamp communication events with integers in such a way that (1) timestamps increase within each process and (2) the sending and the delivery events associated with each message have the same timestamp. So, there is a logical time frame in which for each message, the send event and the corresponding delivery events occur simultaneously. li is stronger than Causally Ordered (co) communication, but weaker than Rendezvous (rdv) communication. li is attractive as it includes co and provides more concurrency than rdv. Moreover it allows to adopt the following approach: rst design a distributed application assuming Rendezvous communication, and then run it on top of an asynchronous distributed system providing only li communication. This paper explores Logically Instantaneous communication and provides a simple and ee-cient protocol that implements li on top of asynchronous distributed systems.